Maximum nonhamiltonian tough graphs
نویسندگان
چکیده
منابع مشابه
Characterizing degree-sum maximal nonhamiltonian bipartite graphs
In 1963, Moon and Moser gave a bipartite analogue to Ore’s famed theorem on hamiltonian graphs. While the sharpness examples of Ore’s Theorem have been independently characterized in at least four different papers, no similar characterization exists for the Moon-Moser Theorem. In this note, we give such a characterization, consisting of one infinite family and two exceptional graphs of order ei...
متن کاملArc reversal in nonhamiltonian circulant oriented graphs
Locke and Witte in 9] have described a class of nonhamiltonian circulant digraphs. We show that for innnitely many of them the reversal of any arc produces a hamil-tonian cycle. This solves an open problem stated in 4]. We use these graphs to construct counterexamples to Add am's conjecture. The smallest one Cay(Z 12 ; 2; 3; 8) 4 is the counterexample with the smallest known number of vertices.
متن کاملEdge bounds in nonhamiltonian k-connected graphs
Let G be a k-connected graph of order n with |E(G)|>(n−k 2 )+ k2. Then for (k = 1, n 3), (k = 2, n 10), and (k = 3, n 16), G is hamiltonian. The bounds are tight and for k = 1, (k = 2, n 12), and (k = 3, n 18) the extremal graphs are unique. A general bound will also be given for the number of edges in a nonhamiltonian k-connected graph, but the bound is not tight. © 2006 Elsevier B.V. All righ...
متن کاملNonhamiltonian 3-Connected Cubic Planar Graphs
We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamiltonian such graphs of order 42. In addition we list all nonhamiltonian cyclically 5-connected cubic planar graphs of order at most 52 and all nonhamiltonian 3-connected cubic planar graphs of girth 5 on at most 46 vert...
متن کاملA Note on Maximal Nonhamiltonian Burkard–Hammer Graphs
A graph G = (V, E) is called a split graph if there exists a partition V = I∪K such that the subgraphs G[I] andG[K] of G induced by I andK are empty and complete graphs, respectively. In 1980, Burkard and Hammer gave a necessary condition for a split graph G with |I| < |K| to be hamiltonian. We will call a split graph G with |I| < |K| satisfying this condition a Burkard–Hammer graph. Further, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1991
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90314-r